Spectrally arbitrary complex sign pattern matrices
نویسندگان
چکیده
An n × n complex sign pattern matrix S is said to be spectrally arbitrary if for every monic nth degree polynomial f(λ) with coefficients from C, there is a complex matrix in the complex sign pattern class of S such that its characteristic polynomial is f(λ). If S is a spectrally arbitrary complex sign pattern matrix, and no proper subpattern of S is spectrally arbitrary, then S is a minimal spectrally arbitrary complex sign pattern matrix. This paper extends the NilpotentJacobian method for sign pattern matrices to complex sign pattern matrices, establishing a means to show that an irreducible complex sign pattern matrix and all its superpatterns are spectrally arbitrary. This method is then applied to prove that for every n ≥ 2 there exists an n×n irreducible, spectrally arbitrary complex sign pattern with exactly 3n nonzero entries. In addition, it is shown that every n × n irreducible, spectrally arbitrary complex sign pattern matrix has at least 3n − 1 nonzero entries.
منابع مشابه
Ela Spectrally
An n × n complex sign pattern matrix S is said to be spectrally arbitrary if for every monic nth degree polynomial f(λ) with coefficients from C, there is a complex matrix in the complex sign pattern class of S such that its characteristic polynomial is f(λ). If S is a spectrally arbitrary complex sign pattern matrix, and no proper subpattern of S is spectrally arbitrary, then S is a minimal sp...
متن کاملInertially arbitrary tree sign patterns of order 4
An n × n sign pattern matrix A is an inertially arbitrary pattern if for every nonnegative triple (n1, n2, n3) with n1 + n2 + n3 = n, there is a real matrix in the sign pattern class of A having inertia (n1, n2, n3). An n× n sign pattern matrix A is a spectrally arbitrary pattern if for any given real monic polynomial r(x) of degree n, there is a real matrix in the sign pattern class of A with ...
متن کاملEla 1150
An n × n sign pattern matrix A is an inertially arbitrary pattern if for every nonnegative triple (n1, n2, n3) with n1 + n2 + n3 = n, there is a real matrix in the sign pattern class of A having inertia (n1, n2, n3). An n× n sign pattern matrix A is a spectrally arbitrary pattern if for any given real monic polynomial r(x) of degree n, there is a real matrix in the sign pattern class of A with ...
متن کاملMinimal Spectrally Arbitrary Sign Patterns
An n × n sign pattern A is spectrally arbitrary if given any self-conjugate spectrum there exists a matrix realization of A with that spectrum. If replacing any nonzero entry (or entries) of A by zero destroys this property, then A is a minimal spectrally arbitrary sign pattern. For n ≥ 3, several families of n × n spectrally arbitrary sign patterns are presented, and their minimal spectrally a...
متن کاملSpectrally arbitrary star sign patterns !
An n × n sign pattern Sn is spectrally arbitrary if, for any given real monic polynomial g(x) of degree n, there is a real matrix having sign pattern Sn and characteristic polynomial g(x). All n × n star sign patterns that are spectrally arbitrary, and all minimal such patterns, are characterized. This subsequently leads to an explicit characterization of all n × n star sign patterns that are p...
متن کامل